A Multi-Start Algorithm for Solving the Capacitated Vehicle Routing Problem with Two-Dimensional Loading Constraints

This work presents a multistart algorithm for solving the capacitated vehicle routing problem with 2D loading constraints (2L-CVRP) allowing rotation of goods. Research dedicated to graph theory and symmetry considered as classical application. has complex aspects that stimulate use advanced algorithms in graphs. The modeling 2L-CVRP by undirected allowed high performance algorithm. developed is based on metaheuristics, such Constructive Genetic Algorithm (CGA) construct promising initial solutions; Tabu Search (TS) improve solutions problem, Large Neighborhood (LNS) subproblem. Although each one these solve parts 2L-CVRP, combination three this was unprecedented scientific literature. In our approach, parallel mechanism checking feasibility routes implemented using multithreading programming performance. Additionally, memory structures hash-tables were save time storing querying previously evaluated results routes. For benchmarks, tests done well-known instances available proved framework matched or outperformed most previous approaches. As main contribution, brings higher quality large-size pure CVRP. paper involves themes related journal, mainly algorithms, graphs, search strategies, complexity, modeling, genetic algorithms. addition, especially focuses topic-related special interest community involved studies, theory.